Automated Theorem Proving by Test Set Induction
نویسندگان
چکیده
منابع مشابه
Automated Theorem Proving by Test Set Induction
Test set induction is a goal-directed proof technique which combines the full power of explicit induction and proof by consistency. It works by computing an appropriate explicit induction scheme called a test set, to trigger the induction proof, and then applies a refutation principle using proof by consistency techniques. We present a general scheme for test set induction together with a simpl...
متن کاملAutomated Theorem Proving
Material for the course Automated Theorem Proving at Carnegie Mellon University, Fall 1999. This includes revised versions from the course notes on Linear Logic (Spring 1998) and Computation and Deduction (Spring 1997). Material for this course is available at http://www.cs.cmu.edu/~fp/courses/atp/. Please send comments to [email protected] This material is in rough draft form and is likely to cont...
متن کاملAutomated Theorem Proving in aSimple
Higher-order representation techniques allow elegant encod-ings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally incompatible with induction principles needed to reason about them. In this paper we develop a meta-logic M2 which allows inductive reasoning over LF encodings, and describe its implementation in Twelf, a special-purpose automa...
متن کاملAutomated Theorem Proving: an Overview
Automated Theorem Provers are computer programs written to prove, or help in proving, mathematical and non-mathematical theorems. Automated Theorem Proving (ATP) is a rapidly advancing field and contains many potential research areas. This paper is an overview of this important field. It starts by giving the needed mathematical background followed by an overview. The overview includes historica...
متن کاملHigher-Order Automated Theorem Proving
The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1997
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0076